C:/Documents and Settings/Hossein Sheini/My Documents/MichiganPhD/Papers/solvers/ario/paper.dvi
نویسندگان
چکیده
Ario is a solver for systems of linear integer arithmetic logic. Such systems are commonly used in design verification applications and are classified under Satisfiability Modulo Theories (SMT) problems. Recognizing the fact that in many such applications the majority of atoms are equalities or integer unit-two-variable inequalities (UTVPIs), we present a framework that integrates specialized theory solvers for those atoms within a SAT solver. The unique feature of our strategy is its simultaneous adoption of both a congruence-closure equality solver and a transitive-closure UTVPI solver to find a satisfiable set of those atoms. A full-scale ILP solver is then utilized to check the consistency of all integer constraints within the solution. Other notable features of our solver include its combined deduction and learning schemes that collectively make our solver distinct among similar solvers.
منابع مشابه
C:/Documents and Settings/Eric/My Documents/My Papers/CElegans-Paper/Version_7/celegans_supmat.dvi
Recall that our mechanical worm (MW) model used in the simulation portion of our study is constructed from a chain of spherical beads of radius a. Each bead, indexed by n, is centered at Yn, and has an orientation vector t̂n. The vector t̂n is also used as the unit tangent to the worm’s centerline. Each bead is also subject to several forces and torques which sum to zero at each moment in the dyn...
متن کاملA Progressive Simplifier for Satisfiability Modulo Theories
In this paper we present a new progressive cooperating simplifier for deciding the satisfiability of a quantifier-free formula in the first-order theory of integers involving combinations of sublogics, referred to as Satisfiability Modulo Theories (SMT). Our approach, given an SMT problem, replaces each non-propositional theory atom with a Boolean indicator variable yielding a purely propositio...
متن کامل